منابع مشابه
On k-intersection edge colourings
We propose the following problem. For some k ≥ 1, a graph G is to be properly edge coloured such that any two adjacent vertices share at most k colours. We call this the k-intersection edge colouring. The minimum number of colours sufficient to guarantee such a colouring is the k-intersection chromatic index and is denoted χk(G). Let fk be defined by fk(∆) = max G:∆(G)=∆ {χk(G)}. We show that f...
متن کاملRECONFIGURING k-COLOURINGS OF COMPLETE BIPARTITE GRAPHS
Let H be a graph, and k ≥ χ(H) an integer. We say that H has a Gray code of k-colourings if and only if it is possible to list all its k-colourings in such a way that consecutive colourings (including the last and the first) agree on all vertices of H except one. The Gray code number of H is the least integer k0(H) such that H has a Gray code of its k-colourings for all k ≥ k0(H). For complete ...
متن کاملBroadcasting colourings on trees. A combinatorial view
The broadcasting models on a d-ary tree T arise in many contexts such as discrete mathematics, biology, information theory, statistical physics and computer science. We consider the k-colouring model, i.e. the root of T is assigned an arbitrary colour and, conditional on this assignment, we take a random colouring of T . A basic question here is whether the information of the assignment at the ...
متن کاملRK-Means Clustering: K-Means with Reliability
This paper presents an RK-means clustering algorithm which is developed for reliable data grouping by introducing a new reliability evaluation to the K-means clustering algorithm. The conventional K-means clustering algorithm has two shortfalls: 1) the clustering result will become unreliable if the assumed number of the clusters is incorrect; 2) during the update of a cluster center, all the d...
متن کاملOn constructing minimum spanning trees in Rk 1 Sergei
We give an algorithm to nd a minimum spanning tree in the k-dimensional space under rectilinear metric. The running time is O(8 k p k n(lg n) k?2 lg lg n) for k 3. This improves the previous bound by a factor p k lg 2 n=4 k .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2017
ISSN: 1232-9274
DOI: 10.7494/opmath.2017.37.4.491